Permutations Destroying Arithmetic Structure
نویسندگان
چکیده
Given a linear form C1X1 + · · · + CnXn, with coefficients in the integers, we characterize exactly the countably infinite abelian groups G for which there exists a permutation f that maps all solutions (α1, . . . , αn) ∈ Gn (with the αi not all equal) to the equation C1X1+ · · ·+CnXn = 0 to non-solutions. This generalises a result of Hegarty about permutations of an abelian group avoiding arithmetic progressions. We also study the finite version of the problem suggested by Hegarty. We show that the number of permutations of Z/pZ that map all 4-term arithmetic progressions to non-progressions, is asymptotically e−1p!.
منابع مشابه
Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups
A permutation π of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a, b, c) is a non-trivial 3-term AP in G, that is c − b = b − a and a, b, c are not all equal, then (π(a), π(b), π(c)) is not an AP. In a paper from 2004, the first author conjectured that such a permutation exists of Zn, for all n 6∈ {2, 3, 5, 7}. Here we prove, as a special case of a more gene...
متن کاملPermutations that Destroy Arithmetic Progressions in Elementary p-Groups
Given an abelian group G, it is natural to ask whether there exists a permutation π of G that “destroys” all nontrivial 3-term arithmetic progressions (APs), in the sense that π(b)− π(a) 6= π(c)− π(b) for every ordered triple (a, b, c) ∈ G3 satisfying b − a = c − b 6= 0. This question was resolved for infinite groups G by Hegarty, who showed that there exists an AP-destroying permutation of G i...
متن کاملAN ARITHMETIC OF COMPLETE PERMUTATIONS CONSl?RAMRi, I: AN EXPOSITION OF THE GENERAL THEORY
We develop an arithrretic of complete permutations of sy-ilmetric, integral bases; this arithmetic is comparable to that of perfect systems of difference sets with which there are several interrelations. Super-position of permutations provides the addition of this arithmetic. Addition if facilitated by complete permutations with a certain “rplitting” property, allowing them to be pulled apart a...
متن کاملForbidden arithmetic progressions in permutations of subsets of the integers
Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...
متن کاملLinear-Time Ranking of Permutations
A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutations. This is frequently used for indexing data structures by permutations. We present algorithms for computing both the ranking function and its inverse using O(n) arithmetic operations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015